A Square Block Format for Symmetric Band Matrices
نویسندگان
چکیده
This contribution describes a Square Block, SB, format for storing a banded symmetric matrix. This is possible by rearranging “in place” LAPACK Band Layout to become a SB layout: store submatrices as a set of square blocks. The new format reduces storage space, provides higher locality of memory accesses, results in regular access patterns, and exposes parallelism.
منابع مشابه
Three Algorithms for Cholesky Factorization on Distributed Memory Using Packed Storage
We present three algorithms for Cholesky factorization using minimum block storage for a distributed memory (DM) environment. One of the distributed square blocked packed (SBP) format algorithms performs similar to ScaLAPACK PDPOTRF, and with iteration overlapping outperforms it by as much as 67%. By storing the blocks in a standard contiguous way, we get better performing BLAS operations. Our ...
متن کاملOn the Block Triangular Form of Symmetric Matrices
We present some observations on the block triangular form (btf) of structurally symmetric, square, sparse matrices. If the matrix is structurally rank deficient, its canonical btf has at least one underdetermined and one overdetermined block. We prove that these blocks are transposes of each other. We further prove that the square block of the canonical btf, if present, has a special fine struc...
متن کاملEigenvectors of block circulant and alternating circulant matrices
The eigenvectors and eigenvalues of block circulant matrices had been found for real symmetric matrices with symmetric submatrices, and for block circulant matrices with circulant submatrices. The eigenvectors are now found for general block circulant matrices, including the Jordan Canonical Form for defective eigenvectors. That analysis is applied to Stephen J. Watson’s alternating circulant m...
متن کاملON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION
The matrix functions appear in several applications in engineering and sciences. The computation of these functions almost involved complicated theory. Thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. The aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. More...
متن کاملNew Generalized Data Structures for Matrices Lead to a Variety of High Performance Algorithms
We describe new data structures for full storage of general matrices that generalize the current storage layouts of the Fortran and C programming languages. We also describe new data structures for full and packed storage of dense symmetric/triangular arrays that generalize both full and packed storage. Using the new data structures, one is led to several new algorithms that save “half” the sto...
متن کامل